Higher-order associative commutative pattern matching for component retrieval
نویسندگان
چکیده
منابع مشابه
Non-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables
Pattern matching is a powerful tool which is part of many functional programming languages as well as computer algebra systems such as Mathematica. Among the existing systems, Mathematica offers the most expressive pattern matching. Unfortunately, no open source alternative has comparable pattern matching capabilities. Notably, these features include support for associative and/or commutative f...
متن کاملAlgebraic Higher-Order Matching
The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.
متن کاملAssociative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose ...
متن کاملPattern retrieval in threshold-linear associative nets.
Networks of threshold-linear neurons have previously been introduced and analysed as distributed associative memory systems. Here, results from simulations of pattern retrieval in a large-scale, sparsely connected network are presented. The storage capacity lies near a = 0.8 and 1.2 for binary and ternary patterns respectively, in reasonable accordance with theoretical estimates. The system is ...
متن کاملHigher-order matching for program transformation
The tension between abstraction and efficiency in programming can be easedby program transformation; programs which are highly abstract and read-able, but inefficient, are automatically converted to efficient forms, allowingthe programmer to gain the advantages of having easy to understand andmaintainable source whilst also obtaining reasonable performance from thecompil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.008